On the Moore-Penrose Pseudo Inverse of the Incidence Matrix for Weighted Undirected Graph

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The M–matrix Moore–Penrose inverse problem for weighted paths

Abstract. A well–known property of an irreducible non–singular M–matrix is that its inverse is non–negative. However, when the matrix is an irreducible and singular M–matrix it is known that it has a generalized inverse which is non–negative, but this is not always true for any generalized inverse. We focus here in characterizing when the Moore–Penrose inverse of a symmetric, singular, irreduci...

متن کامل

The optimal perturbation bounds for the weighted Moore-Penrose inverse

In this paper, we obtain optimal perturbation bounds of the weighted Moore-Penrose inverse under the weighted unitary invariant norm, the weighted Q-norm and the weighted F -norm, and thereby extend some recent results.

متن کامل

Fast computing of the Moore-Penrose inverse matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

متن کامل

Ela Fast Computing of the Moore - Penrose Inverse Matrix

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m× n matrices and of square matrices with at least one zero row or column. Sufficient conditions are also given for special type products of square matrices so that the reverse order law for the Moore-Penrose inverse is satisfied.

متن کامل

Ela the Moore - Penrose Inverse of a Free Matrix

A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2020

ISSN: 1877-0509

DOI: 10.1016/j.procs.2020.02.126